Structure and Eecient Computation of Multiplication Tables and Associated Quadratic Forms 1 Domain and Motivation 2 Multiplication Table 2.1 Characterization
نویسندگان
چکیده
We characterize the multiplication table of an algebra with a multiplicative unity and derive properties of multiplication tables and associated quadratic forms, which allow eecient computation. We compare several ways of computing a multiplication table and associated quadratic forms. By index permutation the complexity of the computation time of associated quadratic forms can be reduced. Exploiting the structure concerning equal entries in the multiplication table gives a further speedup. We apply our results to the case of the factor ring K x]=I and give speedups in the appendix. Let A be a nite dimensional vector space over a eld K and let be a commutative and associative operation ("multiplication") such that (A;) becomes a commutative algebra (associativity is silently assumed here). Furthermore let have a unity ("1") throughout. Instead of a b, for a; b 2 A, we shall simply write ab. Given a basis V = fv 1 ; : : :v d g of A the operation induces a multiplication table w k ij ; 1 i; j; k d; given by v i v j = d X k=1 w k ij v k : (1) In the following we will omit the symbol P for summation. Instead an index appearing both as super-index and subindex will indicate summation over this index (Einstein sum convention, tensor notation). The range of the index will here always be d, the dimension of A. Hence (1) can be written simply as v i v j = w k ij v k. Any such algebra is isomorphic to a factor ring A := K x]=I, where x is an abbreviation for x 1 ; : : :x r and I a zero-dimensional ideal (see the appendix for a proof). The need to compute the multiplication table and associated quadratic forms for a factor ring comes from an algorithm counting common real zeros of a polynomial system ((Pederson et al. 94]). Since is commutative and associative and has a multiplicative unity, for the multiplication table several properties hold. Actually a multiplication table can be characterized by the following lemma. Lemma 2.1 A three dimensional matrix w k ij ; i; j; k = 1 : : :d; is a multiplication table of an algebra (A;) with a multiplicate unity, if and only if the following properties hold: 1. w k ij = w k ji ,
منابع مشابه
MULTIPLICATION MODULES THAT ARE FINITELY GENERATED
Let $R$ be a commutative ring with identity and $M$ be a unitary $R$-module. An $R$-module $M$ is called a multiplication module if for every submodule $N$ of $M$ there exists an ideal $I$ of $R$ such that $N = IM$. It is shown that over a Noetherian domain $R$ with dim$(R)leq 1$, multiplication modules are precisely cyclic or isomorphic to an invertible ideal of $R$. Moreover, we give a charac...
متن کاملON COMULTIPLICATION AND R-MULTIPLICATION MODULES
We state several conditions under which comultiplication and weak comultiplication modulesare cyclic and study strong comultiplication modules and comultiplication rings. In particular,we will show that every faithful weak comultiplication module having a maximal submoduleover a reduced ring with a finite indecomposable decomposition is cyclic. Also we show that if M is an strong comultiplicati...
متن کاملA characterization of finitely generated multiplication modules
Let $R$ be a commutative ring with identity and $M$ be a finitely generated unital $R$-module. In this paper, first we give necessary and sufficient conditions that a finitely generated module to be a multiplication module. Moreover, we investigate some conditions which imply that the module $M$ is the direct sum of some cyclic modules and free modules. Then some properties of Fitting ideals o...
متن کاملArchitecture-eecient Strassen's Matrix Multiplication: a Case Study of Divide-and-conquer Algorithms Architecture-eecient Strassen's Matrix Multiplication: a Case Study of Divide-and-conquer Algorithms
Many fast algorithms in arithmetic complexity have hierarchical or recursive structures that make eecient implementations on high performance computers with memory hierarchies non-trivial. In this paper we present our ndings on eecient implementation of Strassen's algorithmm17] for the ubiquitous operation of matrix multiplication as a model for a class of recursive algorithms. In comparison to...
متن کاملA New Parallel Matrix Multiplication Method Adapted on Fibonacci Hypercube Structure
The objective of this study was to develop a new optimal parallel algorithm for matrix multiplication which could run on a Fibonacci Hypercube structure. Most of the popular algorithms for parallel matrix multiplication can not run on Fibonacci Hypercube structure, therefore giving a method that can be run on all structures especially Fibonacci Hypercube structure is necessary for parallel matr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1995